Rewriting Logical Rules as Sroiq Axioms: Theory and Implementation
نویسندگان
چکیده
Rewriting Logical Rules as SROIQ Axioms: Theory and Implementation
منابع مشابه
Rewriting Rules into SROIQ Axioms
Description Logics are a family of very expressive logics but some forms of knowledge are much more intuitive to formulate otherwise, say, as rules. Rules in DL can be dealt with two approaches: (i) use rules as they are knowing that it leads to undecidability. (ii) or make the rules DL-safe, which will restrict their semantic impact and, e.g., loose the nice “car owners are engine owners” infe...
متن کاملAn Extension of Regularity Conditions for Complex Role Inclusion Axioms
The description logic (DL) SROIQ [1] provides a logical foundation for the new version of the web ontology language OWL 2. In comparison to the DL SHOIN which underpins the first version of OWL, SROIQ provides several new constructors for classes and axioms. One of the new powerful features of SROIQ are so-called complex role inclusion axioms (RIAs) which allow for expressing implications betwe...
متن کاملThe rewriting logic semantics project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balan...
متن کاملElimination of Complex RIAs without Automata
We present an algorithm that eliminates complex role inclusion axioms (RIAs) from a SROIQ ontology preserving all logical consequences not involving non-simple roles. Unlike other existing methods, our algorithm does not explicitly construct finite automata recognizing the languages generated by the RIAs. Instead, it is formulated as a recursive expansion of universal restrictions, similar to w...
متن کاملRewriting modulo a rewrite system
We introduce rewriting with two sets of rules, the rst interpreted equa-tionally and the second not. A semantic view considers equational rules as deening an equational theory and reduction rules as deening a rewrite relation modulo this theory. An operational view considers both sets of rules as similar. We introduce suucient properties for these two views to be equivalent (up to diierent noti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008